- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources6
- Resource Type
-
0002000004000000
- More
- Availability
-
42
- Author / Contributor
- Filter by Author / Creator
-
-
Quan, Q (2)
-
Tang, Wei N. (2)
-
Wei, N (2)
-
Yu, Jingjin (2)
-
Zhou, Y (2)
-
Adhikari, K. P. (1)
-
Adhikari, S. (1)
-
Angelini, G. (1)
-
Anisovich, A. V. (1)
-
Avakian, H. (1)
-
Barion, L. (1)
-
Battaglieri, M. (1)
-
Bedlinskiy, I. (1)
-
Biselli, A. S. (1)
-
Boiarinov, S. (1)
-
Briscoe, W. J. (1)
-
Brock, J. (1)
-
Brooks, W. K. (1)
-
Burkert, V. D. (1)
-
CLAS Collaboration (1)
-
- Filter by Editor
-
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
& Sahin. I. (0)
-
& Spitzer, S. (0)
-
& Spitzer, S.M. (0)
-
(submitted - in Review for IEEE ICASSP-2024) (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Free, publicly-accessible full text available October 23, 2026
-
Luo, Y; Wei, N; Lu, X; Zhou, Y; Tao, F; Quan, Q; Liao, C; Jiang, L; Xia, J; Huang, Y; et al (, Nature Geoscience)Free, publicly-accessible full text available July 22, 2026
-
Tang, Wei N.; Han, Shuai D.; Yu, Jingjin (, 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems)
-
Tang, Wei N.; Yu, Jingjin (, International Symposium on Robotics Research)We examine an important combinatorial challenge in clearing clutter using a mobile robot equipped with a manipulator, seeking to compute an optimal object removal sequence for minimizing the task completion time, assuming that each object is grasped once and then subsequently removed. On the structural side, we establish that such an optimal sequence can be NP-hard to compute, even when no two objects to be removed have any overlap. Then, we construct asymptotically optimal and heuristic algorithms for clutter removal. Employing dynamic programming, our optimal algorithm scales to 40 objects. On the other hand, for random clutter, fast greedy algorithms tend to produce solutions com- parable to these generated by the optimal algorithm.more » « less
-
Chen, Y.; Gao, P.; Summe, M.; Philip, W.; Wei, N. (, Journal of membrane science)
-
Roy, P.; Park, S.; Crede, V.; Anisovich, A. V.; Klempt, E.; Nikonov, V. A.; Sarantsev, A. V.; Wei, N. C.; Huang, F.; Nakayama, K.; et al (, Physical Review Letters)
An official website of the United States government

Full Text Available